Marginal queue length approximations for a two-layered network with correlated queues

نویسندگان

  • Jan-Pieter L. Dorsman
  • Onno J. Boxma
  • Maria Vlasiou
چکیده

We consider an extension of the classical machine-repair model. As opposed to the classical model, we assume that the machines, apart from receiving service from the repairman, also supply service themselves to queues of products. The extended model can be viewed as a layered queueing network (LQN), where the first layer consists of two separate queues of products. Each of these queues is served by its own machine. The second layer consists of a waiting buffer and a repairman, able to restore the machines into an operational state. When a machine breaks down, it waits in the repair buffer for the repairman to become available. Since the repair time of one machine may affect the period of time the other machine is not able to process products, the downtimes of the machines are correlated. We explicitly model the correlation between the downtimes, which leads to correlation between the queues of products in the first layer. Taking these correlations into account, we obtain approximations for the marginal distributions of the queue lengths in the first layer, by the study of a single server vacation queue. Extensive numerical results show that these approximations are highly accurate. Funded in the framework of the STAR-project “Multilayered queueing systems” by the Netherlands Organization for Scientific Research (NWO). The research of M. Vlasiou is also partly supported by an NWO individual grant through project 632.003.002. ∗EURANDOM and Department of Mathematics and Computer Science, Eindhoven University of Technology, P.O. Box 513, 5600 MB Eindhoven, The Netherlands †Probability and Stochastic Networks, Centum Wiskunde & Informatica (CWI), P.O. Box 94079, 1090 GB Amsterdam, The Netherlands

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Analysis of a two-layered network with correlated queues by means of the power-series algorithm

We consider an extension of the classical machine-repair model, also known as the computer-terminal model or time-sharing model. As opposed to the classical model, we assume that the machines, apart from receiving service from the repairman, supply service themselves to queues of products. The extended model can be viewed as a two-layered queueing network, of which the first layer consists of t...

متن کامل

A Mathematical Analysis on Linkage of a Network of Queues with Two Machines in a Flow Shop including Transportation Time

This paper represents linkage network of queues consisting of biserial and parallel servers linked to a common server in series with a flowshop scheduling system consisting of two machines. The significant transportation time of the jobs from one machine to another is also considered. Further, the completion time of jobs/customers (waiting time + service time) in the queue network is the set...

متن کامل

Queue Length Distribution in a FIFO Single-Server Queue with Multiple Arrival Streams Having Different Service Time Distributions

This paper considers the queue length distribution in a class of FIFO single-server queues with (possibly correlated) multiple arrival streams, where the service time distribution of customers from each arrival stream may differ from one another among streams. It is widely recognized that the queue length distribution in a FIFO queue with multiple non-Poissonian arrival streams having different...

متن کامل

A two-queue polling model with two priority levels in the first queue

In this paper we consider a single-server cyclic polling system consisting of two queues. Between visits to successive queues, the server is delayed by a random switch-over time. Two types of customers arrive at the first queue: high and low priority customers. For this situation the following service disciplines are considered: gated, globally gated, and exhaustive. We study the cycle time dis...

متن کامل

Approximations for the Queue Length Distributions of Time-Varying Many-Server Queues

This paper presents a novel methodology for approximating the queue length (the number of customers in the system) distributions of time-varying non-Markovian manyserver queues (e.g., Gt/Gt/nt queues), where the number of servers (nt) is large. Our methodology consists of two steps. The first step uses phase-type distributions to approximate the general inter-arrival and service times, thus gen...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Queueing Syst.

دوره 75  شماره 

صفحات  -

تاریخ انتشار 2013